#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <climits>
#include <vector>
#define int long long
#define x first 
#define y second 

using namespace std;
const int N = 1e5 + 10;
typedef pair<int,int> PII;
PII p[N];

void solve()
{
    int n;
    cin >> n;
    // scanf("%lld",&n);
    
    vector<int> a(n);
    vector<int> b(n);

    int A = 0;
    int B = 0;
    for(int i = 0; i < n; i++) 
    {
        //scanf("%lld%lld",&p[i].first , &p[i].second);

        cin >> p[i].x >> p[i].y;
        A += p[i].x;
        B += p[i].y;
        a[i] = p[i].x;
        b[i] = p[i].y;
    }
   
   // cout << A << " " << B << endl;

    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    int min_aa = a.front();
    int sec_min_aa = a[1];
    int max_aa = a.back();
    int sec_max_aa = a[n - 2];
    int min_bb = b.front();
    int sec_min_bb = b[1];
    int max_bb = b.back();
    int sec_max_bb = b[n - 2];
   
    for(int i = 0; i < n; i++)
    {
        int a1 = A - p[i].x;
        int b1 = B - p[i].y;
        

        if(p[i].x == max_aa)
        {
            a1 = a1 - min_aa - sec_max_aa;
        }
        else if(p[i].x == min_aa)
        {
            a1 = a1 - sec_min_aa - max_aa;
        }
        else a1 = a1 - max_aa - min_aa;

        //  cout << a1 << endl;

         if(p[i].y == max_bb)
        {
            b1 = b1 - min_bb - sec_max_bb;
        }
        else if(p[i].y == min_bb)
        {
            b1 = b1 - sec_min_bb - max_bb;
        }
        else b1 = b1 - min_bb - max_bb;

      //  cout << a1 << " " << b1 << endl;

        double m1 = (a1 * 1.0 ) / ((n - 3) * 1.0);
        double m2 = (b1 * 1.0 ) / ((n - 3) * 1.0);
       
        //printf("%.7lf\n" , ((m1 + m2) * 1.0 / 2.0));

        cout << fixed << setprecision(7) << (double)((m1 + m2) * 1.0 / 2.0)  << endl;
    }

}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t = 1;
    while(t -- ) solve();
    return 0;
}